Halvade: scalable sequence analysis with MapReduce
نویسندگان
چکیده
منابع مشابه
Halvade: scalable sequence analysis with MapReduce
MOTIVATION Post-sequencing DNA analysis typically consists of read mapping followed by variant calling. Especially for whole genome sequencing, this computational step is very time-consuming, even when using multithreading on a multi-core machine. RESULTS We present Halvade, a framework that enables sequencing pipelines to be executed in parallel on a multi-node and/or multi-core compute infr...
متن کاملHalvade-RNA: Parallel variant calling from transcriptomic data using MapReduce
Given the current cost-effectiveness of next-generation sequencing, the amount of DNA-seq and RNA-seq data generated is ever increasing. One of the primary objectives of NGS experiments is calling genetic variants. While highly accurate, most variant calling pipelines are not optimized to run efficiently on large data sets. However, as variant calling in genomic data has become common practice,...
متن کاملScalable RDF data compression with MapReduce
The Semantic Web contains many billions of statements, which are released using the resource description framework (RDF) data model. To better handle these large amounts of data, high performance RDF applications must apply a compression technique. Unfortunately, because of the large input size, even this compression is challenging. In this paper, we propose a set of distributed MapReduce algor...
متن کاملScalable Graph Processing : Beyond MapReduce
My research interests are in the areas of (graph) databases, data analytics and data quality. My research is driven by a strong desire to make big, complex linked data easy to access and understand, for users at various knowledge levels. No data is an island. The rising of big graph data, such as biological networks, social graphs, knowledge graphs, Web graphs, cyber networks and physical netwo...
متن کاملScalable Distributed Reasoning Using MapReduce
We address the problem of scalable distributed reasoning, proposing a technique for materialising the closure of an RDF graph based on MapReduce. We have implemented our approach on top of Hadoop and deployed it on a compute cluster of up to 64 commodity machines. We show that a naive implementation on top of MapReduce is straightforward but performs badly and we present several non-trivial opt...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bioinformatics
سال: 2015
ISSN: 1367-4803,1460-2059
DOI: 10.1093/bioinformatics/btv179